翻訳と辞書 Words near each other ・ Library of Ashurbanipal ・ Library of Birmingham ・ Library of Celsus ・ Library of Congress ・ Library of Congress (film) ・ Library of Congress Classification ・ Library of Congress Control Number ・ Library of Congress Country Studies ・ Library of Congress Linked Data Service ・ Library of Congress Living Legend ・ Library of Congress Police ・ Library of Congress Prize for American Fiction ・ Library of Congress Recordings ・ Library of Congress Subject Headings ・ Library of Economics and Liberty ・ Library of Efficient Data types and Algorithms ・ Library of Friedrich Nietzsche ・ Library of Jonava ・ Library of Living Philosophers ・ Library of Lodz University of Technology ・ Library of Michigan ・ Library of Parliament ・ Library of Pergamum ・ Library of Sir Thomas Browne ・ Library of Soul ・ Library of the Congress of Mexico ・ Library of the Fathers ・ Library of the Free University of Bozen-Bolzano ・ Library of the Printed Web ・ Library of the Russian Academy of Sciences Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Library of Efficient Data types and Algorithms ： ウィキペディア英語版 Library of Efficient Data types and Algorithms The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad variety of algorithms for graph theory and computational geometry.〔.〕 It was originally developed by the Max Planck Institute for Informatics Saarbrücken. Since 2001, LEDA is further developed and distributed by the Algorithmic Solutions Software GmbH. LEDA is available under Free, Research, and Professional editions. The Free edition is freeware, with source code access available for purchase. The Research and Professional editions require payment of licensing fees for any use. ==References== 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Library of Efficient Data types and Algorithms」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.